Rational Acceptance and Conjunctive/Disjunctive Absorption
نویسنده
چکیده
A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.
منابع مشابه
Implications, coimplications and left semi-uninorms on a complete lattice
In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...
متن کاملUpper and Lower Set Formulas: Restriction and Modification of the Dempster-pawlak Formalism†
A modification of Dempster’s and Pawlak’s constructs forms a new foundation for the identification of upper and lower sets formulas. Also, in this modified Dempster-Pawlak construct we require that subsets of the power set be restricted to the wellknown information granules of the power set. An aggregation of upper information granules amongst each other and lower information granules amongst e...
متن کاملConjunctive Query Containment in the Presence of Disjunctive Integrity Constraints
This paper considers the problem of containment of conjunctive queries CQ with disjunctive integrity constraints Query containment problem in the pres ence of integrity constraints has been studied broadly especially with functional and inclusion dependencies However to handle incomplete information in the database disjunctions are needed to be expressed as integrity constraints In this paper w...
متن کاملConjunctive Query Containment in the Presence of Disjunctive Integrity Constraints (extended Abstract)
This paper considers the problem of containment of conjunctive queries (CQ) with disjunctive integrity constraints. Query containment problem in the presence of integrity constraints has been studied broadly, especially with functional and inclusion dependencies. However, to handle incomplete information in the database, disjunctions are needed to be expressed as integrity constraints. In this ...
متن کاملResearch Note: The Accuracy of Group Majorities for Disjunctive and Conjunctive Decision Tasks
For complex group decision tasks which can be described in terms of establishing the truth value of conjunctive (and) or disjunctive (or) composite propositions, the advantage for group judgmental accuracy of disaggregating the decision task into separate individual evaluations of the truth value of each component atomic proposition in the composite is investigated. For true propositions it is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 15 شماره
صفحات -
تاریخ انتشار 2006